On the Independent Neighborhood Polynomial of the Rooted Product of Two Trees

Let G be a connected graph. We say that given graph is tree if every pair ofvertices by unique path. The rooted product of two trees relevant to tree, as the obtained another tree. In this paper, we establish independent neighborhood sets and obtain its corresponding polynomial. Furthermore, polynomial were determine using their sets.